Lattices over Bass Rings and Graph Agglomerations
نویسندگان
چکیده
Abstract We study direct-sum decompositions of torsion-free, finitely generated modules over a (commutative) Bass ring R through the factorization theory corresponding monoid T ( ). Results Levy–Wiegand and Levy–Odenthal together with local case yield an explicit description The is typically neither factorial nor cancellative. Nevertheless, we construct transfer homomorphism to graph agglomerations—a natural class monoids serving as combinatorial models for As consequence, ) Krull finite type several finiteness results on arithmetical invariants apply. also establish elasticity characterize when half-factorial. (Factoriality, that is, torsion-free Krull–Remak–Schmidt–Azumaya, characterized by theorem Levy–Odenthal.) agglomerations introduced here are independent interest.
منابع مشابه
Completeness results for metrized rings and lattices
The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (for example, ${0})$ that are closed under the natural metric, but has no prime ideal closed under that metric; hence closed radical ideals are not, in general, intersections of closed prime ideals. Moreover, $B$ is known to be complete in its metric. Togethe...
متن کاملZero-Divisor Graph of Triangular Matrix Rings over Commutative Rings
Let R be a noncommutative ring. The zero-divisor graph of R, denoted by Γ(R), is the (directed) graph with vertices Z(R)∗ = Z(R)− {0}, the set of nonzero zero-divisors of R, and for distinct x, y ∈ Z(R)∗, there is an edge x → y if and only if xy = 0. In this paper we investigate the zero-divisor graph of triangular matrix rings over commutative rings. Mathematics Subject Classification: 16S70; ...
متن کاملCodes over rings, complex lattices and Hermitian modular forms
We introduce the finite ring S2m = Z2m + iZ2m . We develop a theory of self-dual codes over this ring and relate self-dual codes over this ring to complex unimodular lattices. We describe a theory of shadows for these codes and lattices. We construct a gray map from this ring to the ring Z2m and relate codes over these rings, giving special attention to the case when m = 2. We construct various...
متن کاملA Hybrid Gaussian Sampler for Lattices over Rings
Gaussian sampling over lattices is a cornerstone of latticebased cryptography as it allows to build numerous cryptographic primitives. There are two main algorithms performing this task. The rst one is due to Klein (SODA 2000) and Gentry, Peikert and Vaikuntanathan (STOC 2008), and outputs vectors of good quality but runs rather slowly, in quadratic time. The second one is due to Peikert (CRYPT...
متن کاملOn zero divisor graph of unique product monoid rings over Noetherian reversible ring
Let $R$ be an associative ring with identity and $Z^*(R)$ be its set of non-zero zero divisors. The zero-divisor graph of $R$, denoted by $Gamma(R)$, is the graph whose vertices are the non-zero zero-divisors of $R$, and two distinct vertices $r$ and $s$ are adjacent if and only if $rs=0$ or $sr=0$. In this paper, we bring some results about undirected zero-divisor graph of a monoid ring o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebras and Representation Theory
سال: 2021
ISSN: ['1386-923X', '1572-9079']
DOI: https://doi.org/10.1007/s10468-021-10040-2